0.02/0.08 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.09 % Command : run_E %s %d THM 0.08/0.29 % Computer : n018.cluster.edu 0.08/0.29 % Model : x86_64 x86_64 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.29 % Memory : 8042.1875MB 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.29 % CPULimit : 960 0.08/0.29 % WCLimit : 120 0.08/0.29 % DateTime : Tue Aug 9 04:58:45 EDT 2022 0.08/0.29 % CPUTime : 0.13/0.38 Running higher-order on 8 cores theorem proving 0.13/0.38 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.13/0.38 # Version: 3.0pre003-ho 0.13/0.40 # Preprocessing class: HSMSSMSSMLLNHSN. 0.13/0.40 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.13/0.40 # Starting new_ho_10_cnf2 with 600s (5) cores 0.13/0.40 # Starting post_as_ho3 with 120s (1) cores 0.13/0.40 # Starting new_ho_12 with 120s (1) cores 0.13/0.40 # Starting new_bool_2 with 120s (1) cores 0.13/0.40 # post_as_ho3 with pid 12196 completed with status 0 0.13/0.40 # Result found by post_as_ho3 0.13/0.40 # Preprocessing class: HSMSSMSSMLLNHSN. 0.13/0.40 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.13/0.40 # Starting new_ho_10_cnf2 with 600s (5) cores 0.13/0.40 # Starting post_as_ho3 with 120s (1) cores 0.13/0.40 # No SInE strategy applied 0.13/0.40 # Search class: HGHNM-FFSF31-SHSSMFNN 0.13/0.40 # partial match(1): HGHNM-FFMF31-SHSSMFNN 0.13/0.40 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.13/0.40 # Starting new_ho_10 with 65s (1) cores 0.13/0.40 # new_ho_10 with pid 12200 completed with status 0 0.13/0.40 # Result found by new_ho_10 0.13/0.40 # Preprocessing class: HSMSSMSSMLLNHSN. 0.13/0.40 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.13/0.40 # Starting new_ho_10_cnf2 with 600s (5) cores 0.13/0.40 # Starting post_as_ho3 with 120s (1) cores 0.13/0.40 # No SInE strategy applied 0.13/0.40 # Search class: HGHNM-FFSF31-SHSSMFNN 0.13/0.40 # partial match(1): HGHNM-FFMF31-SHSSMFNN 0.13/0.40 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.13/0.40 # Starting new_ho_10 with 65s (1) cores 0.13/0.40 # Preprocessing time : 0.002 s 0.13/0.40 # Presaturation interreduction done 0.13/0.40 0.13/0.40 # Proof found! 0.13/0.40 # SZS status Theorem 0.13/0.40 # SZS output start CNFRefutation 0.13/0.40 thf(decl_22, type, qmltpeq: mu > mu > $i > $o). 0.13/0.40 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.13/0.40 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_26, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_27, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.13/0.40 thf(decl_28, type, mtrue: $i > $o). 0.13/0.40 thf(decl_29, type, mfalse: $i > $o). 0.13/0.40 thf(decl_30, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_31, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_32, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_33, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_34, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_35, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.13/0.40 thf(decl_36, type, exists_in_world: mu > $i > $o). 0.13/0.40 thf(decl_37, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.13/0.40 thf(decl_38, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.13/0.40 thf(decl_39, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.13/0.40 thf(decl_40, type, mreflexive: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_41, type, msymmetric: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_42, type, mserial: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_43, type, mtransitive: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_44, type, meuclidean: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_45, type, mpartially_functional: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_46, type, mfunctional: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_47, type, mweakly_dense: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_48, type, mweakly_connected: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_49, type, mweakly_directed: ($i > $i > $o) > $o). 0.13/0.40 thf(decl_50, type, mvalid: ($i > $o) > $o). 0.13/0.40 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.13/0.40 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.13/0.40 thf(decl_53, type, minvalid: ($i > $o) > $o). 0.13/0.40 thf(decl_54, type, rel_s4: $i > $i > $o). 0.13/0.40 thf(decl_55, type, mbox_s4: ($i > $o) > $i > $o). 0.13/0.40 thf(decl_56, type, mdia_s4: ($i > $o) > $i > $o). 0.13/0.40 thf(decl_57, type, closed: mu > $i > $o). 0.13/0.40 thf(decl_58, type, open: mu > $i > $o). 0.13/0.40 thf(decl_59, type, h: mu > $i > $o). 0.13/0.40 thf(decl_60, type, combo: mu > mu > $i > $o). 0.13/0.40 thf(decl_61, type, o: mu). 0.13/0.40 thf(decl_62, type, n: mu). 0.13/0.40 thf(decl_63, type, d: mu). 0.13/0.40 thf(decl_64, type, epred1_3: mu > $i > mu > $o). 0.13/0.40 thf(decl_65, type, esk1_1: $i > mu). 0.13/0.40 thf(decl_66, type, esk2_1: $i > mu). 0.13/0.40 thf(decl_67, type, esk3_0: $i). 0.13/0.40 thf(decl_68, type, esk4_0: $i). 0.13/0.40 thf(decl_69, type, esk5_2: mu > mu > $i). 0.13/0.40 thf(decl_70, type, esk6_3: mu > $i > mu > mu). 0.13/0.40 thf(mand, axiom, ((mand)=(^[X4:$i > $o, X5:$i > $o]:(mnot @ (mor @ (mnot @ X4) @ (mnot @ X5))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mand)). 0.13/0.40 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mnot)). 0.13/0.40 thf(mor, axiom, ((mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)|(X5 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mor)). 0.13/0.40 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o]:(mor @ (mnot @ X4) @ X5))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mimplies)). 0.13/0.40 thf(mexists_ind, axiom, ((mexists_ind)=(^[X12:mu > $i > $o]:(mnot @ (mforall_ind @ (^[X13:mu]:(mnot @ (X12 @ X13))))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mexists_ind)). 0.13/0.40 thf(mforall_ind, axiom, ((mforall_ind)=(^[X10:mu > $i > $o, X3:$i]:(![X11:mu]:(((exists_in_world @ X11 @ X3)=>(X10 @ X11 @ X3)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mforall_ind)). 0.13/0.40 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mvalid)). 0.13/0.40 thf(mbox_s4, axiom, ((mbox_s4)=(^[X4:$i > $o, X3:$i]:(![X7:$i]:((~((rel_s4 @ X3 @ X7))|(X4 @ X7)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', mbox_s4)). 0.13/0.40 thf(con, conjecture, (mvalid @ (mbox_s4 @ (mexists_ind @ (^[X25:mu]:(mexists_ind @ (^[X23:mu]:(mimplies @ (mbox_s4 @ (mand @ (combo @ d @ X25) @ (h @ X23))) @ (mbox_s4 @ (open @ d))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', con)). 0.13/0.40 thf(mreflexive, axiom, ((mreflexive)=(^[X6:$i > $i > $o]:(![X15:$i]:((X6 @ X15 @ X15))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax', mreflexive)). 0.13/0.40 thf(ax1, axiom, (mvalid @ (mbox_s4 @ (mforall_ind @ (^[X21:mu]:(mforall_ind @ (^[X22:mu]:(mexists_ind @ (^[X23:mu]:(mand @ (mbox_s4 @ (mimplies @ (mand @ (closed @ X21) @ (mand @ (combo @ X21 @ X22) @ (h @ X23))) @ (mbox_s4 @ (open @ X21)))) @ (mbox_s4 @ (mimplies @ (mand @ (closed @ X21) @ (mand @ (mnot @ (combo @ X21 @ X22)) @ (h @ o))) @ (mbox_s4 @ (closed @ X21))))))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax1)). 0.13/0.40 thf(a1, axiom, (mreflexive @ rel_s4), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax', a1)). 0.13/0.40 thf(ax2, axiom, (mvalid @ (mbox_s4 @ (closed @ d))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax2)). 0.13/0.40 thf(existence_of_d_ax, axiom, ![X7:$i]:((exists_in_world @ d @ X7)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', existence_of_d_ax)). 0.13/0.40 thf(ax4, axiom, (mvalid @ (mbox_s4 @ (mforall_ind @ (^[X20:mu]:(mnot @ (mand @ (open @ X20) @ (closed @ X20))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax4)). 0.13/0.40 thf(ax5, axiom, (mvalid @ (mexists_ind @ (^[X24:mu]:(mbox_s4 @ (combo @ d @ X24))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', ax5)). 0.13/0.40 thf(c_0_16, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])). 0.13/0.40 thf(c_0_17, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.13/0.40 thf(c_0_18, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.13/0.40 thf(c_0_19, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.13/0.40 thf(c_0_20, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X35:mu]:(((exists_in_world @ X35 @ Z1)=>(~((Z0 @ X35 @ Z1)))))))))), inference(fof_simplification,[status(thm)],[mexists_ind])). 0.13/0.40 thf(c_0_21, plain, ((mforall_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(![X11:mu]:(((exists_in_world @ X11 @ Z1)=>(Z0 @ X11 @ Z1)))))), inference(fof_simplification,[status(thm)],[mforall_ind])). 0.13/0.40 thf(c_0_22, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16, c_0_17]), c_0_18])). 0.13/0.40 thf(c_0_23, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19, c_0_17]), c_0_18])). 0.13/0.40 thf(c_0_24, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X35:mu]:(((exists_in_world @ X35 @ Z1)=>(~((Z0 @ X35 @ Z1)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_17]), c_0_21])). 0.13/0.40 thf(c_0_25, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.13/0.40 thf(c_0_26, plain, ((mbox_s4)=(^[Z0:$i > $o, Z1:$i]:(![X7:$i]:((~((rel_s4 @ Z1 @ X7))|(Z0 @ X7)))))), inference(fof_simplification,[status(thm)],[mbox_s4])). 0.13/0.40 thf(c_0_27, plain, ![X50:mu, X52:$i, X51:mu]:(((epred1_3 @ X51 @ X52 @ X50)<=>~(![X49:mu]:(((exists_in_world @ X49 @ X52)=>~(~((~(![X46:$i]:((~(rel_s4 @ X52 @ X46)|(~(~((~(closed @ X51 @ X46)|~(~((~(combo @ X51 @ X50 @ X46)|~(h @ X49 @ X46)))))))|![X45:$i]:((~(rel_s4 @ X46 @ X45)|(open @ X51 @ X45)))))))|~(![X48:$i]:((~(rel_s4 @ X52 @ X48)|(~(~((~(closed @ X51 @ X48)|~(~(((combo @ X51 @ X50 @ X48)|~(h @ o @ X48)))))))|![X47:$i]:((~(rel_s4 @ X48 @ X47)|(closed @ X51 @ X47))))))))))))))), introduced(definition)). 0.13/0.40 thf(c_0_28, negated_conjecture, ~(![X66:$i, X65:$i]:((~(rel_s4 @ X66 @ X65)|~(![X64:mu]:(((exists_in_world @ X64 @ X65)=>~(~(![X63:mu]:(((exists_in_world @ X63 @ X65)=>~((~(![X61:$i]:((~(rel_s4 @ X65 @ X61)|~((~(combo @ d @ X64 @ X61)|~(h @ X63 @ X61))))))|![X62:$i]:((~(rel_s4 @ X65 @ X62)|(open @ d @ X62))))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]), c_0_22]), c_0_23]), c_0_24]), c_0_25]), c_0_26])])). 0.13/0.40 thf(c_0_29, plain, ![X50:mu, X52:$i, X51:mu]:(((epred1_3 @ X51 @ X52 @ X50)=>~(![X49:mu]:(((exists_in_world @ X49 @ X52)=>~(~((~(![X46:$i]:((~(rel_s4 @ X52 @ X46)|(~(~((~(closed @ X51 @ X46)|~(~((~(combo @ X51 @ X50 @ X46)|~(h @ X49 @ X46)))))))|![X45:$i]:((~(rel_s4 @ X46 @ X45)|(open @ X51 @ X45)))))))|~(![X48:$i]:((~(rel_s4 @ X52 @ X48)|(~(~((~(closed @ X51 @ X48)|~(~(((combo @ X51 @ X50 @ X48)|~(h @ o @ X48)))))))|![X47:$i]:((~(rel_s4 @ X48 @ X47)|(closed @ X51 @ X47))))))))))))))), inference(split_equiv,[status(thm)],[c_0_27])). 0.13/0.40 thf(c_0_30, negated_conjecture, ![X95:mu, X96:mu, X97:$i]:(((rel_s4 @ esk3_0 @ esk4_0)&((((combo @ d @ X95 @ X97)|~(rel_s4 @ esk4_0 @ X97)|~(exists_in_world @ X96 @ esk4_0)|~(exists_in_world @ X95 @ esk4_0))&((h @ X96 @ X97)|~(rel_s4 @ esk4_0 @ X97)|~(exists_in_world @ X96 @ esk4_0)|~(exists_in_world @ X95 @ esk4_0)))&(((rel_s4 @ esk4_0 @ (esk5_2 @ X95 @ X96))|~(exists_in_world @ X96 @ esk4_0)|~(exists_in_world @ X95 @ esk4_0))&(~(open @ d @ (esk5_2 @ X95 @ X96))|~(exists_in_world @ X96 @ esk4_0)|~(exists_in_world @ X95 @ esk4_0)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])])). 0.13/0.40 thf(c_0_31, plain, ((mreflexive)=(^[Z0:$i > $i > $o]:(![X15:$i]:((Z0 @ X15 @ X15))))), inference(fof_simplification,[status(thm)],[mreflexive])). 0.13/0.40 thf(c_0_32, plain, ![X99:mu, X100:$i, X101:mu, X103:$i, X104:$i, X105:$i, X106:$i]:((((exists_in_world @ (esk6_3 @ X99 @ X100 @ X101) @ X100)|~(epred1_3 @ X101 @ X100 @ X99))&((~(rel_s4 @ X100 @ X103)|(~(closed @ X101 @ X103)|(~(combo @ X101 @ X99 @ X103)|~(h @ (esk6_3 @ X99 @ X100 @ X101) @ X103))|(~(rel_s4 @ X103 @ X104)|(open @ X101 @ X104)))|~(epred1_3 @ X101 @ X100 @ X99))&(~(rel_s4 @ X100 @ X105)|(~(closed @ X101 @ X105)|((combo @ X101 @ X99 @ X105)|~(h @ o @ X105))|(~(rel_s4 @ X105 @ X106)|(closed @ X101 @ X106)))|~(epred1_3 @ X101 @ X100 @ X99))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])])])). 0.13/0.40 thf(c_0_33, negated_conjecture, ![X3:$i, X11:mu, X13:mu]:(((h @ X11 @ X3)|~((rel_s4 @ esk4_0 @ X3))|~((exists_in_world @ X11 @ esk4_0))|~((exists_in_world @ X13 @ esk4_0)))), inference(split_conjunct,[status(thm)],[c_0_30])). 0.13/0.40 thf(c_0_34, plain, ![X53:$i, X52:$i]:((~(rel_s4 @ X53 @ X52)|![X51:mu]:(((exists_in_world @ X51 @ X52)=>![X50:mu]:(((exists_in_world @ X50 @ X52)=>(epred1_3 @ X51 @ X52 @ X50))))))), inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax1]), c_0_17]), c_0_22]), c_0_23]), c_0_21]), c_0_24]), c_0_25]), c_0_26])]), c_0_27])). 0.13/0.40 thf(c_0_35, plain, ![X41:$i]:((rel_s4 @ X41 @ X41)), inference(apply_def,[status(thm)],[a1, c_0_31])). 0.13/0.40 thf(c_0_36, plain, ![X15:$i, X7:$i, X3:$i, X11:mu, X13:mu]:(((open @ X11 @ X15)|~((rel_s4 @ X3 @ X7))|~((closed @ X11 @ X7))|~((combo @ X11 @ X13 @ X7))|~((h @ (esk6_3 @ X13 @ X3 @ X11) @ X7))|~((rel_s4 @ X7 @ X15))|~((epred1_3 @ X11 @ X3 @ X13)))), inference(split_conjunct,[status(thm)],[c_0_32])). 0.13/0.40 thf(c_0_37, negated_conjecture, ![X11:mu, X3:$i]:(((h @ X11 @ X3)|~((exists_in_world @ X11 @ esk4_0))|~((rel_s4 @ esk4_0 @ X3)))), inference(condense,[status(thm)],[c_0_33])). 0.13/0.40 thf(c_0_38, plain, ![X79:$i, X80:$i, X81:mu, X82:mu]:((~(rel_s4 @ X79 @ X80)|(~(exists_in_world @ X81 @ X80)|(~(exists_in_world @ X82 @ X80)|(epred1_3 @ X81 @ X80 @ X82))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])). 0.13/0.40 thf(c_0_39, plain, ![X72:$i]:((rel_s4 @ X72 @ X72)), inference(variable_rename,[status(thm)],[c_0_35])). 0.13/0.40 thf(c_0_40, plain, ![X60:$i, X59:$i]:((~(rel_s4 @ X60 @ X59)|(closed @ d @ X59))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax2, c_0_25]), c_0_26])])). 0.13/0.40 thf(c_0_41, negated_conjecture, ![X7:$i, X13:mu, X11:mu, X3:$i, X15:$i]:(((open @ X11 @ X3)|~((exists_in_world @ (esk6_3 @ X13 @ X7 @ X11) @ esk4_0))|~((epred1_3 @ X11 @ X7 @ X13))|~((combo @ X11 @ X13 @ X15))|~((rel_s4 @ esk4_0 @ X15))|~((rel_s4 @ X15 @ X3))|~((rel_s4 @ X7 @ X15))|~((closed @ X11 @ X15)))), inference(spm,[status(thm)],[c_0_36, c_0_37])). 0.13/0.40 thf(c_0_42, plain, ![X3:$i, X13:mu, X11:mu]:(((exists_in_world @ (esk6_3 @ X11 @ X3 @ X13) @ X3)|~((epred1_3 @ X13 @ X3 @ X11)))), inference(split_conjunct,[status(thm)],[c_0_32])). 0.13/0.40 thf(c_0_43, plain, ![X3:$i, X13:mu, X11:mu, X7:$i]:(((epred1_3 @ X11 @ X7 @ X13)|~((rel_s4 @ X3 @ X7))|~((exists_in_world @ X11 @ X7))|~((exists_in_world @ X13 @ X7)))), inference(split_conjunct,[status(thm)],[c_0_38])). 0.13/0.40 thf(c_0_44, plain, ![X3:$i]:((rel_s4 @ X3 @ X3)), inference(split_conjunct,[status(thm)],[c_0_39])). 0.13/0.40 thf(c_0_45, plain, ![X91:$i, X92:$i]:((~(rel_s4 @ X91 @ X92)|(closed @ d @ X92))), inference(variable_rename,[status(thm)],[c_0_40])). 0.13/0.40 thf(c_0_46, plain, ![X3:$i, X13:mu, X11:mu, X7:$i]:(((open @ X11 @ X3)|~((epred1_3 @ X11 @ esk4_0 @ X13))|~((combo @ X11 @ X13 @ X7))|~((rel_s4 @ esk4_0 @ X7))|~((rel_s4 @ X7 @ X3))|~((closed @ X11 @ X7)))), inference(spm,[status(thm)],[c_0_41, c_0_42])). 0.13/0.40 thf(c_0_47, plain, ![X13:mu, X11:mu, X3:$i]:(((epred1_3 @ X11 @ X3 @ X13)|~((exists_in_world @ X13 @ X3))|~((exists_in_world @ X11 @ X3)))), inference(spm,[status(thm)],[c_0_43, c_0_44])). 0.13/0.40 thf(c_0_48, negated_conjecture, ![X3:$i, X13:mu, X11:mu]:(((combo @ d @ X11 @ X3)|~((rel_s4 @ esk4_0 @ X3))|~((exists_in_world @ X13 @ esk4_0))|~((exists_in_world @ X11 @ esk4_0)))), inference(split_conjunct,[status(thm)],[c_0_30])). 0.13/0.40 thf(c_0_49, plain, ![X87:$i]:((exists_in_world @ d @ X87)), inference(variable_rename,[status(thm)],[existence_of_d_ax])). 0.13/0.40 thf(c_0_50, plain, ![X3:$i, X7:$i]:(((closed @ d @ X7)|~((rel_s4 @ X3 @ X7)))), inference(split_conjunct,[status(thm)],[c_0_45])). 0.13/0.40 thf(c_0_51, plain, ![X44:$i, X43:$i]:((~(rel_s4 @ X44 @ X43)|![X42:mu]:(((exists_in_world @ X42 @ X43)=>~(~((~(open @ X42 @ X43)|~(closed @ X42 @ X43)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax4]), c_0_17]), c_0_22]), c_0_21]), c_0_25]), c_0_26])])). 0.13/0.40 thf(c_0_52, plain, ![X3:$i, X13:mu, X11:mu, X7:$i]:(((open @ X11 @ X3)|~((combo @ X11 @ X13 @ X7))|~((rel_s4 @ esk4_0 @ X7))|~((exists_in_world @ X13 @ esk4_0))|~((exists_in_world @ X11 @ esk4_0))|~((rel_s4 @ X7 @ X3))|~((closed @ X11 @ X7)))), inference(spm,[status(thm)],[c_0_46, c_0_47])). 0.13/0.40 thf(c_0_53, negated_conjecture, ![X11:mu, X3:$i]:(((combo @ d @ X11 @ X3)|~((exists_in_world @ X11 @ esk4_0))|~((rel_s4 @ esk4_0 @ X3)))), inference(condense,[status(thm)],[c_0_48])). 0.13/0.40 thf(c_0_54, plain, ![X3:$i]:((exists_in_world @ d @ X3)), inference(split_conjunct,[status(thm)],[c_0_49])). 0.13/0.40 thf(c_0_55, plain, ![X3:$i]:((closed @ d @ X3)), inference(spm,[status(thm)],[c_0_50, c_0_44])). 0.13/0.40 thf(c_0_56, plain, ![X58:$i]:(~(![X57:mu]:(((exists_in_world @ X57 @ X58)=>~(![X56:$i]:((~(rel_s4 @ X58 @ X56)|(combo @ d @ X57 @ X56)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax5]), c_0_24]), c_0_25]), c_0_26])])). 0.13/0.40 thf(c_0_57, plain, ![X76:$i, X77:$i, X78:mu]:((~(rel_s4 @ X76 @ X77)|(~(exists_in_world @ X78 @ X77)|(~(open @ X78 @ X77)|~(closed @ X78 @ X77))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])])). 0.13/0.40 thf(c_0_58, negated_conjecture, ![X11:mu, X7:$i, X3:$i]:(((open @ d @ X3)|~((rel_s4 @ esk4_0 @ X7))|~((exists_in_world @ X11 @ esk4_0))|~((rel_s4 @ X7 @ X3)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_54]), c_0_55])])). 0.13/0.40 thf(c_0_59, plain, ![X88:$i, X90:$i]:(((exists_in_world @ (esk2_1 @ X88) @ X88)&(~(rel_s4 @ X88 @ X90)|(combo @ d @ (esk2_1 @ X88) @ X90)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])])])])). 0.13/0.40 thf(c_0_60, plain, ![X3:$i, X11:mu, X7:$i]:((~((rel_s4 @ X3 @ X7))|~((exists_in_world @ X11 @ X7))|~((open @ X11 @ X7))|~((closed @ X11 @ X7)))), inference(split_conjunct,[status(thm)],[c_0_57])). 0.13/0.40 thf(c_0_61, negated_conjecture, ![X11:mu, X3:$i]:(((open @ d @ X3)|~((exists_in_world @ X11 @ esk4_0))|~((rel_s4 @ esk4_0 @ X3)))), inference(spm,[status(thm)],[c_0_58, c_0_44])). 0.13/0.40 thf(c_0_62, plain, ![X3:$i]:((exists_in_world @ (esk2_1 @ X3) @ X3)), inference(split_conjunct,[status(thm)],[c_0_59])). 0.13/0.40 thf(c_0_63, plain, ![X11:mu, X3:$i]:((~((exists_in_world @ X11 @ X3))|~((closed @ X11 @ X3))|~((open @ X11 @ X3)))), inference(spm,[status(thm)],[c_0_60, c_0_44])). 0.13/0.40 thf(c_0_64, negated_conjecture, ![X3:$i]:(((open @ d @ X3)|~((rel_s4 @ esk4_0 @ X3)))), inference(spm,[status(thm)],[c_0_61, c_0_62])). 0.13/0.40 thf(c_0_65, negated_conjecture, ![X3:$i]:(~((rel_s4 @ esk4_0 @ X3))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63, c_0_64]), c_0_54]), c_0_55])])). 0.13/0.40 thf(c_0_66, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_65, c_0_44]), ['proof']). 0.13/0.40 # SZS output end CNFRefutation 0.13/0.40 # Parsed axioms : 88 0.13/0.40 # Removed by relevancy pruning/SinE : 0 0.13/0.40 # Initial clauses : 64 0.13/0.40 # Removed in clause preprocessing : 44 0.13/0.40 # Initial clauses in saturation : 20 0.13/0.40 # Processed clauses : 73 0.13/0.40 # ...of these trivial : 0 0.13/0.40 # ...subsumed : 2 0.13/0.40 # ...remaining for further processing : 71 0.13/0.40 # Other redundant clauses eliminated : 0 0.13/0.40 # Clauses deleted for lack of memory : 0 0.13/0.40 # Backward-subsumed : 17 0.13/0.40 # Backward-rewritten : 2 0.13/0.40 # Generated clauses : 71 0.13/0.40 # ...of the previous two non-redundant : 62 0.13/0.40 # ...aggressively subsumed : 0 0.13/0.40 # Contextual simplify-reflections : 0 0.13/0.40 # Paramodulations : 71 0.13/0.40 # Factorizations : 0 0.13/0.40 # NegExts : 0 0.13/0.40 # Equation resolutions : 0 0.13/0.40 # Propositional unsat checks : 0 0.13/0.40 # Propositional check models : 0 0.13/0.40 # Propositional check unsatisfiable : 0 0.13/0.40 # Propositional clauses : 0 0.13/0.40 # Propositional clauses after purity: 0 0.13/0.40 # Propositional unsat core size : 0 0.13/0.40 # Propositional preprocessing time : 0.000 0.13/0.40 # Propositional encoding time : 0.000 0.13/0.40 # Propositional solver time : 0.000 0.13/0.40 # Success case prop preproc time : 0.000 0.13/0.40 # Success case prop encoding time : 0.000 0.13/0.40 # Success case prop solver time : 0.000 0.13/0.40 # Current number of processed clauses : 32 0.13/0.40 # Positive orientable unit clauses : 10 0.13/0.40 # Positive unorientable unit clauses: 0 0.13/0.40 # Negative unit clauses : 1 0.13/0.40 # Non-unit-clauses : 21 0.13/0.40 # Current number of unprocessed clauses: 25 0.13/0.40 # ...number of literals in the above : 140 0.13/0.40 # Current number of archived formulas : 0 0.13/0.40 # Current number of archived clauses : 39 0.13/0.40 # Clause-clause subsumption calls (NU) : 388 0.13/0.40 # Rec. Clause-clause subsumption calls : 112 0.13/0.40 # Non-unit clause-clause subsumptions : 9 0.13/0.40 # Unit Clause-clause subsumption calls : 19 0.13/0.40 # Rewrite failures with RHS unbound : 0 0.13/0.40 # BW rewrite match attempts : 5 0.13/0.40 # BW rewrite match successes : 2 0.13/0.40 # Condensation attempts : 73 0.13/0.40 # Condensation successes : 2 0.13/0.40 # Termbank termtop insertions : 8564 0.13/0.40 0.13/0.40 # ------------------------------------------------- 0.13/0.40 # User time : 0.010 s 0.13/0.40 # System time : 0.003 s 0.13/0.40 # Total time : 0.013 s 0.13/0.40 # Maximum resident set size: 2144 pages 0.13/0.40 0.13/0.40 # ------------------------------------------------- 0.13/0.40 # User time : 0.013 s 0.13/0.40 # System time : 0.004 s 0.13/0.40 # Total time : 0.017 s 0.13/0.40 # Maximum resident set size: 1812 pages 0.13/0.40 EOF